Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems
نویسندگان
چکیده
We investigate the modular communication complexity of the graph accessibility problem GAP and its modular counting versions MODk{GAP, k 2. Due to arguments concerning variation ranks and certain projection reductions, we prove that, for any partition of the input variables and for any moduls k and m, GAP and MODk{GAP have MODm{communication complexity (n), where n denotes the number of nodes of the graphs under consideration.
منابع مشابه
Upper and Lower Bounds for Certain Graph-Accessibility Problems on Bounded Alternating Omega-Branching Programs
In the following we investigate the computational complexity of various !-GRAPH ACCESSIBILITY PROBLEMs on the most general restricted type of !-branching programs for which, up to now, exponential lower bounds on the size can be proved. By means of exponential lower bounds on various ranks of certain communication matrices we prove that !GRAPH ACCESSIBILITY PROBLEMs can not be computed by bound...
متن کاملLower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کاملBounds on First Reformulated Zagreb Index of Graph
The first reformulated Zagreb index $EM_1(G)$ of a simple graph $G$ is defined as the sum of the terms $(d_u+d_v-2)^2$ over all edges $uv$ of $G .$ In this paper, the various upper and lower bounds for the first reformulated Zagreb index of a connected graph interms of other topological indices are obtained.
متن کاملSome lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملLower Bounds for Approximating Graph Parameters via Communication Complexity
In a celebrated work, Blais, Brody, and Matulef [5] developed a technique for proving property testing lower bounds via reductions from communication complexity. Their work focused on testing properties of functions, and yielded new lower bounds as well as simplified analyses of known lower bounds. Here, we take a further step in generalizing the methodology of [5] to analyze the query complexi...
متن کامل